It Appears That Four Colors Suffice: A Historical Overview of the Four-Color Theorem

نویسنده

  • Mark Walters
چکیده

Certainly any mathematical theorem concerning the coloring of maps would be relevant and widely applicable to modern-day cartography. As for the FourColor Theorem, nothing could be further from the truth. Kenneth May, a twentieth century mathematics historian, explains that “books on cartography and the history of map-making do not mention the four-color property, though they often discuss various other problems relating to the coloring of maps.... The four-color conjecture cannot claim either origin or application in cartography” [WIL2]. In addition, there are virtually no other direct applications of this theorem outside of mathematics; however, mathematicians still continue to search for an elegant proof to this day. In Map Coloring, Polyhedra, and the Four-Color Problem, David Barnette guarantees that these efforts have not been wasted. He points out that many advances in graph theory were made during the process of proving the Four-Color Theorem. These advances provide justification for the 150+ years spent proving a theorem with rather useless results [BAR]. In this paper, the historical progress of the Four-Color Theorem will be examined along with the work of some of its contributors. Without doubt, the Four-Color Theorem is one of the few mathematical problems in history whose origin can be dated precisely. Francis Guthrie (183199), a student in London, first posed the conjecture in October, 1852, while he was coloring the regions on a map of England. He noticed that he could color the map using only four colors in such a way so that no two countries sharing a common border receive the same color. Guthrie wanted to know if this were true of all maps and could it be proven mathematically. He explained his conjecture in a letter to his younger brother Frederick, who was a student at University College in London. Frederick could not solve his brother’s problem and he forwarded it to his instructor Augustus DeMorgan (1806-71), a famous mathematician of the nineteenth century. DeMorgan was very impressed with the conjecture and, although he could not solve it himself, he presented the problem to his colleague and friend Sir William Rowan Hamilton (1805-65), the inventor of quaternions, in a famous letter dated October 23, 1852. This final stage in the “Four-Color Conjecture chain letter” marks the birth of the Four-Color Theorem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Technical study of historical tiles of azure and yellow color Spectrum in mosaic and dual tiles

In Iranian architecture, colors were a powerful tool in design that, by using them correctly in decorations, added to the identity and impact of that space. One of the techniques of architects in decorating the space has been the use of complementary colors to create a proper harmony in the viewer's eyes. In this experimental-analytical study, CIE Lab analysis was used to quantitatively measu...

متن کامل

Preference of Broiler Chickens for Feed Color

   Studying broiler preference to feed color is important for improving comfort and welfare of broilers and it may be beneficial for improving performance. The aim of the first experiment was to examine day-old chick's preference in different light colors to different feed colors. One hundred and sixty Ross 308 newly hatched broilers, never exposed to feed, were allocated into pens illuminated ...

متن کامل

Using Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match

An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allens method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested ...

متن کامل

Using Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match

An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allen's method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested...

متن کامل

Coloring graphs using topology

Higher dimensional graphs can be used to color 2dimensional geometric graphs G. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colorable with 4 colors. The later goal is achieved if all interior edge degrees are even. Using a refinement process which cuts the interior along surfaces S we can adapt the degrees along the boundary S. More effic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004